关于图的同构判定方法的探讨

对于两图的同构的判定方法进行较深入的探讨,给出判定两图同构和判定两图不同构的几种方法,并对其判定方法的优劣进行比较.     

On the density of the space of continuous and uniformly continuous functions

For X a metrizable space and (Y,ρ) a metric space, with Y pathwise connected, we compute the density of (C(X,(Y,ρ)),σ)—the space of all continuous functions from X to (Y,ρ), endowed with the supremum metric σ. Also, for (X,d) a metric space and (Y,‖⋅‖) a normed space, we compute the density of (UC((X,d),(Y,ρ)),σ) (the space of all uniformly continuous functions from (X,d) to (Y,ρ), where ρ is the metric induced on Y by ‖⋅‖). We also prove that the latter result extends only partially to the case where (Y,ρ) is an arbitrary pathwise connected metric space.To carry such an investigation out, the notions of generalized compact and generalized totally bounded metric space, introduced by the author and A. Barbati in a former paper, turn out to play a crucial rôle. Moreover, we show that the first-mentioned concept provides a precise characterization of those metrizable spaces which attain their extent.     

Coxeter complexes and graph-associahedra

Given a graph Γ, we construct a simple, convex polytope, dubbed graph-associahedra, whose face poset is based on the connected subgraphs of Γ. This provides a natural generalization of the Stasheff associahedron and the Bott-Taubes cyclohedron. Moreover, we show that for any simplicial Coxeter system, the minimal blow-ups of its associated Coxeter complex has a tiling by graph-associahedra. The geometric and combinatorial properties of the complex as well as of the polyhedra are given. These spaces are natural generalizations of the Deligne-Knudsen-Mumford compactification of the real moduli space of curves.     

On extremally disconnected topological groups

We introduce the notion of a partially selective ultrafilter and prove that (a) if G is an extremally disconnected topological group and p is a converging nonprincipal ultrafilter on G containing a countable discrete subset, then p is partially selective, and (b) the existence of a nonprincipal partially selective ultrafilter on a countable set implies the existence of a P-point in ω^∗. Thus it is consistent with ZFC that there is no extremally disconnected topological group containing a countable discrete nonclosed subset.     

非对称量子阱中非线性光学吸收系数的计算

非对称量子阱中的非线性光学效应因其潜在的实用价值而引起人们的广泛关注,而量子阱内带间的光学吸收问题对研究远红外光学探测器件具有重要的理论指导意义.以Pschl-Teller势阱为例研究了影响非对称量子阱中的非线性光学吸收系数的因素.考虑到带间的电子弛豫,用量子力学中的密度矩阵算符理论导出了Pschl-Teller势阱中的线性与三阶非线性光学吸收系数的表达式.因该势阱中有两个可调参数,通过调节系统的参数,发现该系统的非线性光学吸收系数呈规律性的变化.以典型的GaAs/AlGaAs非对称量子阱为例作了数值计算,通过调节系统的参数,数值计算结果表明,入射光强以及系统的非对称性对量子阱的非线性光学吸收系数有较大的影响,从而为实验上研究非对称量子阱的非线性光学效应提供了必要的理论依据.     

小尺寸铕(Ⅲ)配合物荧光纳米颗粒的制备

利用再沉淀法分别制备出了小尺寸(~10nm)纯相和杂相的Eu³⁺配合物荧光纳米颗粒。所制备的纯相的荧光纳米颗粒在水溶液中容易聚集,并且荧光猝灭严重。相比较而言,掺有适量疏水性硅烷的杂相纳米颗粒则具有较强的荧光、均匀的尺寸和良好的分散性。硅烷在碱性环境下(pH=9)迅速地水解,而后在纳米微粒的表面形成二氧化硅薄层。亲水的二氧化硅薄层消除了Eu³⁺配合物纳米颗粒间的疏水相互作用,进而防止了纳米颗粒的聚集,从而导致了杂相荧光纳米颗粒发光性能的提高。     

一种基于GIS的选址问题及算法

本文考虑了选址区域内存在地理阻断情况下的一种基于GIS的选址问题.对单配送中心选址模型,以GIS返回的任意两点间的最短可行路径的长度作为修正距离函数,分析了目标函数在凸形选址区域上非凸非连续的性质.进一步,采用给出了一种近似搜索算法并通过一个实例计算与重心法进行了比较.     

锥形透镜光纤聚焦特性研究

锥形透镜光纤(TLF)是实现光纤与平面光波光路(PLC)芯片高效耦合的核心元件。了解和掌握其聚焦特性是指导平面光波光路尾纤封装技术的关键。给出了表征锥形透镜光纤聚焦特性的两个参量出射光斑直径和远场发散角的理论分析模型,其误差小于1.14%;采用光束传播法数值模拟了锥形透镜光纤中的光波传输和模斑的演化,确定了锥形透镜光纤端面出射光斑的大小;优化锥形透镜光纤结构参量为:拉锥长度300μm,锥角0.733°,透镜曲率半径13.485μm;建立了基于数字摄像机的锥形透镜光纤出射光场测试系统,提出了物理光学反向推演法,计算出锥形透镜光纤聚焦光斑尺寸和远场发散角。理论与实验结果有着良好的一致:对于相同结构参量的锥形透镜光纤,实验反推法得到的出射光斑尺寸与理论值相比误差为3.15%,远场发散角误差为3.67%。     

双曲分布及其在VaR模型分析中的应用

传统的计算V aR的R iskM etrics方法不能对市场风险分布的“厚尾”现象给出较为满意的刻画和计算方法.本文引入双曲分布及其算法并将双曲分布应用到V aR模型的计算之中,事实上通过对股票市场的实证研究表明,股票市场数据呈厚尾现象,用双曲分布对数据的拟合要比R iskM etrics方法假定的正态分布更符合金融市场数据的实际情况,故本文的结论与方法对金融风险管理和其他金融建模是有价值的.     

Maximizing a Linear Fractional Function on a Pareto Efficient Frontier

We consider the problem of maximizing a linear fractional function on the Pareto efficient frontier of two other linear fractional functions. We present a finite pivoting-type algorithm that solves the maximization problem while computing simultaneously the efficient frontier. Application to multistage efficiency analysis is discussed. An example demonstrating the computational procedure is included.